Algorithms. 31. PERMUT. Simple algorithm generating all permutations

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simple permutations and algebraic generating functions

A simple permutation is one that does not map a nontrivial interval onto an interval. It was recently proved by Albert and Atkinson that a permutation class with only finitely simple permutations has an algebraic generating function. We extend this result to enumerate permutations in such a class satisfying additional properties, e.g., the even permutations, the involutions, the permutations av...

متن کامل

New Algorithm for Listing All Permutations

The most challenging task dealing with permutation is when the element is large. In this paper, a new algorithm for listing down all permutations for n elements is developed based on distinct starter sets. Once the starter sets are obtained, each starter set is then cycled to obtain the first half of distinct permutations. The complete list of permutations is achieved by reversing the order of ...

متن کامل

Generating and Enumerating 321-Avoiding and Skew-Merged Simple Permutations

The simple permutations in two permutation classes — the 321-avoiding permutations and the skew-merged permutations — are enumerated using a uniform method. In both cases, these enumerations were known implicitly, by working backwards from the enumeration of the class, but the simple permutations had not been enumerated explicitly. In particular, the enumeration of the simple skew-merged permut...

متن کامل

Generating all polynomial invariants in simple loops

This paper presents a method for automatically generating all polynomial invariants in simple loops. It is first shown that the set of polynomials serving as loop invariants has the algebraic structure of an ideal. Based on this connection, a fixpoint procedure using operations on ideals and Gröbner basis constructions is proposed for finding all polynomial invariants. Most importantly , it is ...

متن کامل

Generating Pseudo-Random Permutations and Maximum Flow Algorithms

We describe a simple construction of a family of permutations with a certain pseudo-random property. Such a family can be used to derandomize a recent randomized maximum-flow algorithm of Cheriyan and Hagerup for all relatively dense networks. Hence this supplies a deterministic maximum-flow algorithm that works, on a network with n vertices and m edges, in time O(nm) for all m = Ω(n log n) (an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applications of Mathematics

سال: 1973

ISSN: 0862-7940,1572-9109

DOI: 10.21136/am.1973.103471